Robust projection indices

نویسنده

  • Guy P. Nason
چکیده

Loosely speaking a robust projection index is one that prefers projections involving true clusters over projections consisting of a cluster and an outlier. We introduce a mathematical definition of one-dimensional index robustness and describe a numerical experiment to measure it. We design five new indices based on measuring divergence from Student’s t distribution which are intended to be especially robust: the experiment shows that they are more robust than several established indices. The experiment also reveals more generally that the robustness of moment indices depends on the number of approximation terms providing additional practical guidance for existing projection pursuit implementations. We investigate the theoretical properties of one new Student’s t index and Hall’s index and show that the new index automatically adapts its robustness to the degree of outlier contamination. We conclude by outlining the possibilities for extending our experiments both to higher dimensions and other new indices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel Local feature descriptor using the Mercator projection for 3D object recognition

Point cloud processing is a rapidly growing research area of computer vision. Introducing of cheap range sensors has made a great interest in the point cloud processing and 3D object recognition. 3D object recognition methods can be divided into two categories: global and local feature-based methods. Global features describe the entire model shape whereas local features encode the neighborhood ...

متن کامل

Analytic formulae for projection indices in a robustness experiment

Exploratory projection pursuit is a method for finding interesting projections of highdimensional multivariate data sets. Typically interesting projections are found by numerically optimizing a measure of non-normality over projection direction. In general, explicit computation of a projection index is impossible although for certain restricted situations an index may be computed analytically. ...

متن کامل

Projection Pursuit for Exploratory Supervised Classification

In high-dimensional data, one often seeks a few interesting low-dimensional projections that reveal important features of the data. Projection pursuit is a procedure for searching high-dimensional data for interesting low-dimensional projections via the optimization of a criterion function called the projection pursuit index. Very few projection pursuit indices incorporate class or group inform...

متن کامل

Robust Functional Principal Components : a Projection - Pursuit Approach

In many situations, data are recorded over a period of time and may be regarded as realizations of a stochastic process. In this paper, robust estimators for the principal components are considered by adapting the projection pursuit approach to the functional data setting. Our approach combines robust projection–pursuit with different smoothing methods. Consistency of the estimators are shown u...

متن کامل

Robust Projection Matrix Design and Its Application in Compression

The aim of this brief is to design a robust projection matrix for the Compressive Sensing (CS) system when the signal is not exactly sparse. The optimal projection matrix design is obtained by minimizing the Frobenius norm of the difference between the identity matrix and the Gram matrix of the equivalent dictionary ΦΨ. A novel penalty ‖Φ‖F is added to make the projection matrix robust when the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996